uncorrelated limit

نویسندگان

  • Redner
  • P J Reynolds
  • H E Stanley
چکیده

A generalisation of the pure site and pure bond percolation problems is studied, in which both the sites and bonds are independently occupied at random. This generalisa-tion-the site-bond problem-is of current interest because of its application to the phenomenon of polymer gelation. Motivated by considerations of cluster connectivity, we have defined two distinct models for site-bond percolation, models A and B. In model A, a cluster is considered to be a set of occupied bonds and sites in which the bonds are joined by occupied sites, and the sites are joined by occupied bonds. Since a bond cannot contribute to cluster connectivity if either site at its endpoints is not occupied, we define model B in which these 'non-connecting' bonds are treated as part of the cluster perimeter. We prove that the critical curve and critical exponents are the same for both models. For model B, we calculate low-density series expansions for the mean cluster size on the square lattice. We calculate three different series, using the following definitions of cluster size: site size, bond size, and a hybrid measure involving both site and bond size. All three series have been used to obtain the phase boundary between the percolating (gel) and non-percolating (sol) regions. Numerical evidence is presented which indicates that along the entire phase boundary the mean-size exponent y assumes a universal value.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Central limit theorems for correlated variables: some critical remarks

In this talk I first review at an elementary level a selection of central limit theorems, including some lesser known cases, for sums and maxima of uncorrelated and correlated random variables. I recall why several of them appear in physics. Next, I show that there is room for new versions of central limit theorems applicable to specific classes of problems. Finally, I argue that we have insuff...

متن کامل

Achieving the Quadratic Gaussian Rate-Distortion Function for Source Uncorrelated Distortions

We prove achievability of the recently characterized quadratic Gaussian rate-distortion function (RDF) subject to the constraint that the distortion is uncorrelated to the source. This result is based on shaped dithered lattice quantization in the limit as the lattice dimension tends to infinity and holds for all positive distortions. It turns out that this uncorrelated distortion RDF can be re...

متن کامل

Generalized-generalized entropies and limit distributions

Limit distributions are not limited to uncorrelated variables but can be constructively derived for a large class of correlated random variables, as was shown e.g. in the context of large deviation theory [1], and recently in a very general setting by Hilhorst and Schehr [2]. At the same time it has been conjectured, based on numerical evidence, that several limit distributions originating from...

متن کامل

The Classical Limit of Entropic Quantum Dynamics

The framework of entropic dynamics (ED) allows one to derive quantum mechanics as an application of entropic inference. In this work we derive the classical limit of quantum mechanics in the context of ED. Our goal is to find conditions so that the center of mass (CM) of a system of N particles behaves as a classical particle. What is of interest is that ~ remains finite at all steps in the cal...

متن کامل

Measuring the Vulnerability of Interconnection Networks in Embedded Systems

Studies of the fault-tolerance of graphs have tended to largely concentrate on classical graph connectivity. This measure is very basic, and conveys very little information for designers to use in selecting a suitable topology for the interconnection network in embedded systems. In this paper, we study the vulnerability of interconnection networks to the failure of individual links, using a set...

متن کامل

Limiting Index Sort A New Non-Dominated Sorting Algorithm and its Comparison to the State-of-the-Art

....... An important problem in the realm of evolutionary multi-objective optimization (MOO) is that of finding all non-dominated fronts (NDFs). We specifically address the computational efficiency of the non-dominated sorting algorithm for finding the non-dominated fronts for the non-dominated sorting genetic algorithm II (NSGA-II) algorithm. We introduce the Limiting Index Sort (LIS) algorith...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1978